Handelman’s Positivstellensatz for polynomial matrices positive definite on polyhedra
نویسندگان
چکیده
منابع مشابه
On Adaptive Weighted Polynomial Preconditioning for Hermitian Positive Definite Matrices
The conjugate gradient algorithm for solving Hermitian positive definite linear systems is usually combined with preconditioning in order to speed up convergence. In recent years, there has been a revival of polynomial preconditioning, motivated by the attractive features of the method on modern architectures. Standard techniques for choosing the preconditioning polynomial are based only on bou...
متن کاملON f-CONNECTIONS OF POSITIVE DEFINITE MATRICES
In this paper, by using Mond-Pečarić method we provide some inequalities for connections of positive definite matrices. Next, we discuss specifications of the obtained results for some special cases. In doing so, we use α-arithmetic, α-geometric and α-harmonic operator means.
متن کاملRiemannian geometry on positive definite matrices
The Riemannian metric on the manifold of positive definite matrices is defined by a kernel function φ in the form K D(H,K) = ∑ i,j φ(λi, λj) −1TrPiHPjK when ∑ i λiPi is the spectral decomposition of the foot point D and the Hermitian matrices H,K are tangent vectors. For such kernel metrics the tangent space has an orthogonal decomposition. The pull-back of a kernel metric under a mapping D 7→ ...
متن کاملRiemannian Sparse Coding for Positive Definite Matrices
Inspired by the great success of sparse coding for vector valued data, our goal is to represent symmetric positive definite (SPD) data matrices as sparse linear combinations of atoms from a dictionary, where each atom itself is an SPD matrix. Since SPD matrices follow a non-Euclidean (in fact a Riemannian) geometry, existing sparse coding techniques for Euclidean data cannot be directly extende...
متن کاملDeterminantal inequalities for positive definite matrices
Let Ai , i = 1, . . . ,m , be positive definite matrices with diagonal blocks A ( j) i , 16 j 6 k , where A ( j) 1 , . . . ,A ( j) m are of the same size for each j . We prove the inequality det( m ∑ i=1 A−1 i ) > det( m ∑ i=1 (A (1) i ) −1) · · ·det( m ∑ i=1 (A (k) i ) −1) and more determinantal inequalities related to positive definite matrices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Positivity
سال: 2017
ISSN: 1385-1292,1572-9281
DOI: 10.1007/s11117-017-0520-y